Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
نویسندگان
چکیده
منابع مشابه
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
We study the problem of (eeciently) deleting such clauses from conjunctive normal forms (clause-sets) which can not contribute to any proof of unsatissability. For that purpose we introduce the notion of an autarky system, associated with a canonical normal form for every clause-set by deleting superruous clauses. Clause-sets where no clauses can be deleted are called lean, a natural generaliza...
متن کاملOn Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets
DP-reduction F ❀ DPv(F ), applied to a clause-set F and a variable v, replaces all clauses containing v by their resolvents (on v). A basic case, where the number of clauses is decreased (i.e., c(DPv(F )) < c(F )), is singular DP-reduction (sDP-reduction), where v must occur in one polarity only once. For minimally unsatisfiable F ∈ MU , sDPreduction produces another F ′ := DPv(F ) ∈ MU with th...
متن کاملCategorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
Finding out that a SAT problem instance F is unsatisfiable is not enough for applications, where good reasons are needed for explaining the inconsistency (so that for example the inconsistency may be repaired). Previous attempts of finding such good reasons focused on finding some minimally unsatisfiable sub-clause-set F’ of F, which in general suffers from the non-uniqueness of F’ (and thus it...
متن کاملSearching for Autarkies to Trim Unsatisfiable Clause Sets
An autarky is a partial assignment to the variables of a Boolean CNF formula that satisfies every clause containing an assigned variable. For an unsatisfiable formula, an autarky provides information about those clauses that are essentially independent from the infeasibility; clauses satisfied by an autarky are not contained in any minimal unsatisfiable subset (MUS) or minimal correction subset...
متن کاملUnsatisfiable hitting clause-sets with three more clauses than variables
Hitting clause-sets (as CNFs), known in DNF language as “disjoint” or “orthogonal”, are clause-sets F , such that any C,D ∈ F , C 6= D, have a literal x ∈ C with x ∈ D. The set of unsatisfiable such F is denoted by UHIT ⊂ MU (minimal unsatisfiability). A basic fact is δ(F ) ≥ 1 for F ∈ MU , where the deficiency δ(F ) := c(F ) − n(F ) is the difference between the number of clauses and the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00406-7